package com.fyt;

import com.fyt.recover.order.*;

import java.util.function.Consumer;



public class Main {
    public static void main(String[] args) {

        Students a = new Students();
        a.setName("张三");
        a.setAge(18);
        Students b = new Students();
        b.setName("李四");
        b.setAge(20);
        System.out.println(a.compareTo(b));


        Consumer<String> consumer = (String s) -> {
            System.out.println(s);
        };


        consumer.accept("hello");

        System.out.println("------------------------------------------------------------");
       int [] arr={9,1,5,4,6,4,6,5,1,6,5,4,9,8,4,6,5,1,6,5,4,9,8,4,6,1};
        double[] arr7 = {0.42, 0.32, 0.33, 0.52, 0.37, 0.47, 0.51};

      // int [] arr3={4,6,7};
     // int [] arr3={5, 3, 8, 2, 7};
       int [] arr3={3, 1, 2};


       int []   arr2={1,5};
        // InsertOrder.test(arr);

      //   test(arr2,0,1);

       // ShellSort.test(arr);
       // QuikSortbySwap.startSort(arr3);
        //QuikSortbyYanweiming.startSort(arr3);

      //  MergeOrder.start(arr);

      //  HeapSort.sort(arr);
       // CountingSortStartWithZero.CountingSort(arr);
       // MyRadixSort.radixSort(arr);
        BucketSortIntVersion.BucketSortIntVersion(arr,3);

        BucketSortDoubleVersion.BucketSortDoubleVersion(arr7);


     /*   for (int i = 0; i <arr.length ; i++) {
            System.out.println(arr[i]);
        }*/

    }

    public static void test(int [] arr,int i,int j) {
        int temp=arr[i];
        arr[i]=arr[j];
        arr[j]=temp;
    }
}